Sharp lower bounds for the dimension of linearizations of matrix polynomials
نویسندگان
چکیده
A standard way of dealing with matrix polynomial eigenvalue problems is to use linearizations. Byers, Mehrmann and Xu have recently defined and studied linearizations of dimensions smaller than the classical ones. In this paper, lower bounds are provided for the dimensions of linearizations and strong linearizations of a given m×n matrix polynomial, and particular linearizations are constructed for which these bounds are attained. It is also proven that strong linearizations of an n× n regular matrix polynomial of degree must have dimension n × n .
منابع مشابه
Ela Sharp Lower Bounds for the Dimension of Linearizations of Matrix Polynomials∗
A standard way of dealing with matrix polynomial eigenvalue problems is to use linearizations. Byers, Mehrmann and Xu have recently defined and studied linearizations of dimensions smaller than the classical ones. In this paper, lower bounds are provided for the dimensions of linearizations and strong linearizations of a given m×n matrix polynomial, and particular linearizations are constructed...
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملLinearization of Lagrange and Hermite interpolating matrix polynomials
This paper considers interpolating matrix polynomials P (λ) in Lagrange and Hermite bases. A classical approach to investigate the polynomial eigenvalue problem P (λ)x = 0 is linearization, by which the polynomial is converted into a larger matrix pencil with the same eigenvalues. Since the current linearizations of degree n Lagrange polynomials consist of matrix pencils with n + 2 blocks, they...
متن کاملLarge Vector Spaces of Block-symmetric Strong Linearizations of Matrix Polynomials
M. I. BUENO∗, F. M. DOPICO †, S. FURTADO ‡, AND M. RYCHNOVSKY § Abstract. Given a matrix polynomial P (λ) = Pk i=0 λ Ai of degree k, where Ai are n × n matrices with entries in a field F, the development of linearizations of P (λ) that preserve whatever structure P (λ) might posses has been a very active area of research in the last decade. Most of the structure-preserving linearizations of P (...
متن کاملExtending the Notions of Companion and Innnite Companion to Matrix Polynomials Extending the Notions of Companion and Innnite Companion to Matrix Polynomials
An extended innnite companion matrix ~ C 1 (D) and an innnite companion matrix C 1 (D) for a (nonmonic in general) matrix polynomial D is introduced and the nite companion matrix C(D) is generalized to the nonmonic case. These matrices generalize all properties of the innnite and nite companion (Frobenius) matrix corresponding to a scalar polynomial. In particular, C 1 (D) is a controllability ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017